Embedding and Coding below a 1-Generic Degree
نویسندگان
چکیده
منابع مشابه
Embedding and Coding below a 1-Generic Degree
We show that the theory of D(6 g), where g is a 2-generic or a 1-generic degree below 0′, interprets true first order arithmetic. To this end we show that 1-genericity is sufficient to find the parameters needed to code a set of degrees using Slaman and Woodin’s method of coding in Turing degrees. We also prove that any recursive lattice can be embedded below a 1-generic degree preserving top a...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملCoding Theorems for Reversible Embedding
We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...
متن کاملLattice Embeddings below a Nonlow2 Recursively Enumerable Degree
We introduce techniques that allow us to embed below an arbitary nonlow2 recursively enumerable degree any lattice currently known to be embedable into the recursively enumerable degrees.
متن کاملCoding a Generic Extension of L
An easy proof is given to the corollary to Jensen's coding theorem that there exists a class-generic, non-set-generic real. Modifications to the proof allow coding certain generic extensions of L. 1. Introduction This note describes a modification of Jensen coding suitable for coding certain generic extensions of L. As an example, we shall give an elementary proof to the following consequence o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2003
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1091122498